#include <iostream>
#include <cstring>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <set>
#include <bitset>
#include <utility>
using namespace std;

#define mm(a, n) memset(a, n, sizeof a)
#define mk(a, b) make_pair(a, b)

const double eps = 1e-6;
const int INF = 0x3f3f3f3f;

typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int, int> PII;
typedef pair<double, double> PDD;
typedef pair<LL, LL> PLL;
typedef pair<int, LL> PIL;

inline void quickread() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
}

const int N = 110;

int n;
int a[N], b[N];

bool check() {
    for (int i = 0; i < n; i ++ )
        if (a[i] != b[i]) return false;
    return true;
}

inline void solution() {
    cin >> n;
    for (int i = 0; i < n; i ++ ) cin >> a[i];
    for (int i = 0; i < n; i ++ ) cin >> b[i];
    
    int k = 0;
    while (b[k + 1] >= b[k]) k ++ ;

    bool match = true;
    for (int i = k + 1; i < n; i ++ )
        if (a[i] != b[i]) {
            match = false;
            break;
        }
    if (match) {
        cout << "Insertion Sort" << endl;
        sort(a, a + k + 2);
        cout << a[0];
        for (int i = 1; i < n; i ++ )
            cout << " " << a[i];
        cout << endl;
    }
    else {
        cout << "Merge Sort" << endl;
        int k = 1;
        while (true) {
            bool match = check();
            int len = 1 << (k ++ );
            for (int i = 0; i < n; i += len) 
                sort(a + i, a + min(n, i + len));
            if (match) break;
        }
        cout << a[0];
        for (int i = 1; i < n; i ++ )
            cout << " " << a[i];
        cout << endl;
    }

}

int main() {
    freopen("input.txt", "r", stdin);
    quickread();
    solution();
    return 0;
}